A (q, t)-BINOMIAL COEFFICIENT FOR GLn(Fq)
نویسندگان
چکیده
Abstract. We investigate a (q, t)-generalization of the usual binomial and q-binomial coefficients. It can be viewed as a polynomial in t that depends upon an integer q, with combinatorial interpretations when q is a positive integer, and algebraic interpretations when q is the order of a finite field. These polynomials and their interpretations generalize further in two directions, one relating to column-strict tableaux and Macdonald’s “7 variation” of Schur functions, the other relating to permutation statistics and Hilbert series from the invariant theory of GLn(Fq).
منابع مشابه
(q, t)-ANALOGUES AND GLn(Fq) VICTOR REINER AND
Abstract. We start with a (q, t)-generalization of a binomial coefficient. It can be viewed as a polynomial in t that depends upon an integer q, with combinatorial interpretations when q is a positive integer, and algebraic interpretations when q is the order of a finite field. These (q, t)-binomial coefficients and their interpretations generalize further in two directions, one relating to col...
متن کامل( q , t ) - analogues and GLn ( F q )
Abstract. We start with a (q, t)-generalization of a binomial coefficient. It can be viewed as a polynomial in t that depends upon an integer q, with combinatorial interpretations when q is a positive integer, and algebraic interpretations when q is the order of a finite field. These (q, t)-binomial coefficients and their interpretations generalize further in two directions, one relating to col...
متن کاملReiner And
We start with a (q, t)-generalization of a binomial coefficient. It can be viewed as a polynomial in t that depends upon an integer q, with combinatorial interpretations when q is a positive integer, and algebraic interpretations when q is the order of a finite field. These (q, t)-binomial coefficients and their interpretations generalize further in two directions, one relating to column-strict...
متن کامل$\mathbb{F}_{q}[G]$-modules and $G$-invariant codes
If Fq is a finite field and G is a subgroup of the linear automorphisms of F q , a solution to the problem of finding all the G-invariant linear codes C of F q (i.e. such that g(C) = C for all g ∈ G) is offered. This will be referred as the invariance problem. When n = |G|t, we determine conditions for the existance of an isomorphism of Fq[G]modules between F q and Fq[G]× · · · × Fq[G] (t-times...
متن کاملEXPLICIT REALIZATION OF THE DICKSON GROUPS G2(q) AS GALOIS GROUPS
In this paper we are concerned with the construction of polynomials whose Galois groups are the exceptional simple Chevalley groups G2(q), q a prime power, first discovered by Dickson; see Theorems 4.1 and 4.3. It was shown by Nori [7] that all semisimple simply-connected linear algebraic groups over Fq do occur as Galois groups of regular extension of regular function fields over Fq, but his p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008